Binarization of DQP using separate absolute value and sign (SAVS) in CABAC

ABSTRACT

Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of U.S. patentapplication Ser. No. 14/795,102, filed on Jul. 9, 2015, which is acontinuation of U.S. patent application Ser. No. 13/345,320 filed onJan. 6, 2012, which claims the benefit of U.S. provisional patentapplication Ser. No. 61/503,430, filed on Jun. 30, 2011, and whichclaims the benefit of U.S. provisional patent application Ser. No.61/497,281 filed on Jun. 15, 2011. Each of the above-referencedapplications is hereby incorporated herein by reference in its entirety.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

INCORPORATION-BY-REFERENCE OF COMPUTER PROGRAM APPENDIX

Not Applicable

NOTICE OF MATERIAL SUBJECT TO COPYRIGHT PROTECTION

A portion of the material in this patent document is subject tocopyright protection under the copyright laws of the United States andof other countries. The owner of the copyright rights has no objectionto the facsimile reproduction by anyone of the patent document or thepatent disclosure, as it appears in the United States Patent andTrademark Office publicly available file or records, but otherwisereserves all copyright rights whatsoever. The copyright owner does nothereby waive any of its rights to have this patent document maintainedin secrecy, including without limitation its rights pursuant to 37C.F.R. § 1.14.

BACKGROUND OF THE INVENTION 1. Field of the Invention

This invention pertains generally to video coding, and more particularlyto binarization coding in Context-Based Adaptive Binary ArithmeticCoding (CABAC) within high efficiency video coding standards.

2. Description of Related Art

Storage and communication of videos in an efficient manner requirescoding mechanisms for reducing spatial and temporal redundancies.Although a number of coding techniques exist, ongoing efforts aredirected at increasing the efficiencies of these enCOder/DECoders(codecs) which respectively compress and decompress video data streams.The purpose of codecs is to reduce the size of digital video frames inorder to speed up transmission and save storage space. The video codingadvances made over the years have collectively contributed to the highlevels of coding efficiency provided by state-of-the-art codecs. It isdesired, however, that coding be performed at still higher efficienciesto further decrease video bit rates.

The latest of these developing coding standards is referred to as HighEfficiency Video Coding (HEVC), from the Joint Collaborative Team onVideo Coding (JCT-VC), which is a joint effort of the MPEG and VCEGstandardization committees.

This developing standard includes both high efficiency and lowcomplexity configurations includes a number of coding tools and includeseither Context Adaptive Variable Length Coding (CAVLC) in a lowcomplexity configuration, and Context Adaptive Binary Arithmetic Coding(CABAC) in a high efficiency configuration. The High Efficiencyconfiguration uses and supports increased bit precision for internaloperations and an adaptive loop filter.

HEVC employs Coding Unit (CU) structure, whose main difference from amacroblock structure (e.g., in previous MPEG-2 or AVC codecs) is thatinstead of a fixed size (e.g., 16×16), the size can vary up to 128×128.One Largest Coding Unit (LCU) represents both flat area and busy area,whereby providing a single QP value for one LCU is insufficient forobtaining high levels of subjective quality. Accordingly, HEVC separatesthe LCU into Coding-Units (CU), each of which are represented by theirown QP which can differ from one CU to another. Delta-QP (dQP) can thenbe defined as the difference between QP of current CU and predicted QPbased on the selected prediction algorithm within the CUs that are ofsizes, such as 8×8, 16×16, 32×32 or 64×64. HEVC may perform QPprediction similarly as in the Advanced Video Coding (AVC) standard,although any desired technique may be utilized with the presentinvention without departing from the teachings of the invention.

Test model HM 3.0 of the HEVC coding standard uses Delta-QP (dQP)entropy coding in CABAC consisting of two steps: (1) flagging whetherdQP is zero or not, and (2) if dQP is nonzero, the signed dQP is mappedto an unsigned codenumber and the unsigned codenumber is mapped to abinary string using unary codes. It will be noted that unary coding isan entropy encoding in which a natural number ‘n’ is represented by nones followed by a zero or alternatively with n−1 ones followed by azero. For example 5 can be represented as 111110 or 11110 in these unaryrepresentations.

Accordingly, new coding standards are being developed toward increasingcoding efficiency and reducing coding complexity. The present inventionprovides improvements of the Delta-QP (dQP) coding within CABAC entropycoding.

BRIEF SUMMARY OF THE INVENTION

The present invention utilizes a different mode of binarization of thedQP in CABAC to fit the symmetric distribution of dQP. The approach inthe current HM 3.0 test model assigns different lengths to nonzero dQPwith the same absolute values. However, the statistics indicate that thedistribution of dQP has a symmetric property, whereby nonzero dQPshaving the same absolute values but different signs tend to have similarprobabilities. It should be appreciated, however, that the invention canbe applied to all video coding systems and standards which used signedsyntax, such as Delta-QP, and within which the symmetry property isexhibited for positive and negative values.

Toward fitting the true distribution of dQP, this present inventionperforms binarization of dQP in CABAC, with modified steps of: (1)flagging to indicate whether dQP is zero or not, and (2) if dQP isnonzero, the absolute value of dQP is mapped to a binary string usingunary codes. The sign of dQP is then encoded. Alternatively, the sign ofdQP can be encoded first followed by the absolute value of dQP. Eitherof these alternatives is referred to herein as Separate Absolute Valueand Sign (SAVS).

Further aspects and embodiments of the invention will be brought out inthe following portions of the specification, wherein the detaileddescription is for the purpose of fully disclosing preferred embodimentsof the invention without placing limitations thereon.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

The invention will be more fully understood by reference to thefollowing drawings which are for illustrative purposes only:

FIG. 1 is a block diagram of a CABAC based video encoder according to anembodiment of the present invention.

FIG. 2 is a block diagram of a CABAC based video encoder according to anembodiment of the present invention.

FIG. 3 is a flowchart of the new binarization method according to anembodiment of the present invention.

FIG. 4A through FIG. 4B are process flows for binarization in an exampleof dQP=−3, showing a comparison between HM3.0 in FIG. 4A and the methodof the present invention in FIG. 4B.

DETAILED DESCRIPTION OF THE INVENTION

Context-Based Adaptive Binary Arithmetic Coding (CABAC) is one of thetwo entropy coding methods for use in the evolving HEVC standard, andwas found in the H.264/AVC video coding standards. CABAC encodinggenerally consists of binarization, context modeling, and binaryarithmetic coding. The Separate Absolute Value and Sign (SAVS) method ofthe invention provides a refinement of binarization for use in CABACwhich is particularly well-suited for the statistical symmetry ofprobability for positive and negative codes of the same value.

In HEVC test Model (HM) 3.0, each CU may have different QPs. To signalthe QP used to encode the CU, the difference, denoted by “dQP”, betweenQP of the current CU and predicted QP is encoded in the syntax. Thevalue of dQP is encoded by Context-based Adaptive Binary ArithmeticCoding (CABAC) under the HEVC High Efficiency (HE) configuration. Theencoding process consists of two steps: (1) flagging the dQP isnon-zero, and (2) mapping a signed dQP to an unsigned codenumber and thecodenumber is mapped to a bin string using unary codes.

The approach in HM3.0 assigns different lengths to nonzero dQP with thesame absolute values. For example, dQP=−1 is assigned 3 bits, whiledQP=1 is assigned 2 bits. Statistics demonstrate that the distributionof dQP has a symmetric property, in which nonzero dQP having with thesame absolute values but different signs tend to have similarprobabilities.

The present invention encodes dQP in a way such that sign of dQP andabsolute value of dQP are encoded separately. A flag is encodedindicating instances when dQP is non-zero, and then the absolute valueof dQP and the sign of dQP are separately coded, or alternatively, thesign of dQP and then its absolute value are encoded. The separatelycoded sign and absolute value of dQP are combined into the final binarystring. It will be noted that the order of coding the absolute value ofdQP and the sign of dQP is interchangeable according to the invention.

FIG. 1 through FIG. 2 illustrate example embodiments of a codingapparatus comprising an encoder 10 and decoder 50 configured accordingto the invention for coding using CABAC with the SAVS binarizationmechanism.

In the embodiment of the invention shown in FIG. 1 through FIG. 2 theinvention is implemented within the CABAC processing blocks of otherwiseconventional video coding (encoding and/or decoding) system to minimizedevelopment work and toward maximizing compatibility.

The encoder 10 is shown in FIG. 1 having encoding elements 12 executedby one or more processors 44. In the example, video frame input 14 isshown along with with reference frames 16 and frame output 18. Interprediction 20 is depicted with motion estimation (ME) 22, and motioncompensation (MC) 24. Intra prediction 26 is shown with switchingbetween inter and intra prediction. A sum junction 28 is shown withoutput to a forward transform 30, quantization stage 32 and CABAC coding34 with SAVS. An inverse quantization 36 and inverse transform 38 areshown coupled to a summing junction 40 and followed by a filter 42, suchas a deblocking and/or loop filter.

It should be appreciated that the encoder is shown implemented with aprocessing means 44, such as comprising at least one processing device(e.g., CPU) 46 and at least one memory 48 for executing programmingassociated with the encoding. In addition, it will be appreciated thatelements of the present invention can be implemented as programmingstored on a media, which can be accessed for execution by a CPU for theencoder 10 and/or decoder 50.

In the decoder 50 of FIG. 2, decoding blocks 52 are shown along with aprocessing means 76, which is substantially a subset of the elementscontained in the encoder, shown in FIG. 1, operating on reference frames54 and outputting video 74. The decoder blocks receive an encoded videosignal 56 which are processed through a CABAC with SAVS entropy decoder58, inverse quantization 60, inverse transform 62 according to anembodiment of the invention. Summing 64 is shown between the inversetransform 62 output and the selection between inter prediction 66 shownwith motion compensation 68 and intra prediction 70. Output from summingjunction 64 is received by filter 72, which can be configured as a loopfilter, a deblocking filter, or any combination thereof. It should beappreciated that the decoder can be implemented with a processing means76 which comprises at least one processing device 78 and at least onememory 80 for executing programming associated with the encoding. Inaddition, it will be noted that elements of the present invention can beimplemented as programming stored on a media, wherein said media can beaccessed for execution by processing device (CPU) 78.

It should be appreciated that the programming is executable from thememory which is a tangible (physical) computer readable media that isnon-transitory in that it does not merely constitute a transitorypropagating signal, but is actually capable of retaining programming,such as within any desired form and number of static or dynamic memorydevices. These memory devices need not be implemented to maintain dataunder all conditions (e.g., power fail) to be considered herein asnon-transitory media.

It should be appreciated that the programming described herein isexecutable from a memory device (or devices) which comprise a tangible(physical) computer readable media that is non-transitory in that itdoes not merely constitute a transitory propagating signal, but isactually capable of retaining programming, such as within any desiredform and number of static or dynamic memory devices. These memorydevices need not be implemented to maintain data indefinitely, or underall conditions (e.g., power fail) to be considered herein asnon-transitory media.

FIG. 3 is a flowchart of the CABAC SAVS method. The dQP flag is encoded90, such as at the time the dQP value is determined. By way of example,a function is used to encode QP of the current CU, and inside thefunction dQP is first obtained as the difference of QP and the currentCU and predicted CU, after which the dQP flag is encoded. If the dQPflag is found 92 to be non-zero, then the absolute value of dQP ismapped 94 (converted) using unary coding. The sign is also separatelymapped 96 to a unary code, after which the separate codes are combined98 into a string. It should be appreciated that the order of steps 94and 96 can be reversed without impacting operation. If dQP is 0, thenthere is no value of dQP to encode, and for example the function forencoding QP just returns a dQP flag. It will be noted that a dQP flag isalways encoded to indicate whether dQP is non-zero. In the non-zeroexamples of dQP described, it will be recognized that dQP always startswith a one “1” bit.

FIG. 4A illustrates an example of binarization according to CABAC in theHM3.0 test specification. It is seen in this example of dQP at step 100equal to −3 that the value (sign and absolute value) are unary coded atstep 102 as a single entity with codenumber 5, resulting at step 104 inbitstring “111110” taking 5 binary places. The string in this exampleand in FIG. 4B, described below, does not illustrate the non-zero dQPbit preceding the coding of dQP.

FIG. 4B illustrates an example of binarization according to CABAC SAVS.The same example coding 110 of −3 is shown with separate coding of signand absolute value. Absolute value of 3 is taken at step 112, resultingat step 114 of codenumber 2, and at step 116 of bitstring 110 requiring3 binary places. Similarly, the sign is coded at step 118, resulting atstep 120 of codenumber 1, and at step 122 of bitstring 1. In step 124the bitstrings are combined resulting to result in 1101, or 1110,depending on the order of combination. It should be appreciated that thenumber of binary digits required by this encoding is a total of 4 binarydigits, as compared to the 6 digits used by the conventional coding.

As can be seen, therefore, the present invention includes the followinginventive embodiments among others:

1. An apparatus for performing video coding, comprising: a computerconfigured for encoding and/or decoding of video; and programmingconfigured for execution on said computer for: performinginter-prediction and/or intra-prediction for reducing temporal and/orspatial redundancies; performing a transform and quantization duringencoding and/or inverse transform and inverse quantization duringdecoding; performing context-based adaptive binary arithmetic coding(CABAC) during encoding and/or decoding; and performing binarization ofa non-zero Delta-QP (dQP) by (a) mapping absolute value of dQP usingunary coding; (b) separately coding sign of dQP; and (c) combiningbinary strings for sign and absolute value.

2. The apparatus of embodiment 1, wherein said programming isalternatively configured for execution on said computer for coding ofthe sign for dQP prior to coding of the absolute value of dQP.

3. The apparatus of embodiment 1: wherein said video coding apparatusutilizes a Coding Unit (CU) structure in which block sizes are notfixed, and in which the Largest Coding Unit (LCU) is separated intomultiple CU each having its own QP which can differ from one CU toanother; and wherein Delta-QP (dQP) signals the difference between QP ofthe current CU and predicted QP is encoded in the syntax.

4. The apparatus of embodiment 1, wherein said video coding is performedaccording to the High Efficiency Video Coding (HEVC) standard.

5. The apparatus of embodiment 4, wherein said video coding is performedin a high efficiency coding mode within the High Efficiency Video Coding(HEVC) standard.

6. The apparatus of embodiment 1, wherein said apparatus comprises acoder/decoder (CODEC).

7. The apparatus of embodiment 1, wherein said programming is configuredfor execution on said computer for coding a flag bit indicating that dQPis non-zero, prior to the coding of the non-zero dQP and its sign.

8. The apparatus of embodiment 1, wherein said binarization benefitsfrom the value of dQP having similar probability of being positive ornegative for a given absolute value.

9. A method of performing video coding, comprising: performinginter-prediction and/or intra-prediction for reducing temporal and/orspatial redundancies; performing a transform and quantization duringencoding and/or inverse transform and inverse quantization duringdecoding; performing context-based adaptive binary arithmetic coding(CABAC) during encoding and/or decoding; and performing binarization ofa non-zero Delta-QP (dQP) by (a) mapping absolute value of dQP usingunary coding; (b) separately coding sign of dQP; and (c) combiningbinary strings for sign and absolute value.

10. The method as recited in embodiment 1, wherein coding of the signfor dQP is alternatively performed prior to mapping of the absolutevalue of dQP.

11. The method as recited in embodiment 9: wherein said video codingmethod utilizes a Coding Unit (CU) structure in which block sizes arenot fixed, and in which the Largest Coding Unit (LCU) is separated intoCUs each having its own QP which can differ from one CU to another; andwherein Delta-QP (dQP) signals the difference between QP of the currentCU and predicted QP is encoded in the syntax.

12. The method as recited in embodiment 9, wherein said video coding isperformed according to the High Efficiency Video Coding (HEVC) standard.

13. The method as recited in embodiment 12, wherein said video coding isperformed in a high efficiency coding mode within the High EfficiencyVideo Coding (HEVC) standard.

14. The method as recited in embodiment 9, wherein said apparatuscomprises a coder/decoder (CODEC).

15. The method as recited in embodiment 9, wherein a flag bit is codedindicating that dQP is non-zero prior to the coding of the non-zero dQPand its sign.

16. The method as recited in embodiment 9, wherein said binarizationbenefits from the value of dQP having similar probability of beingpositive or negative for a given absolute value.

17. A non-transitory computer-readable media containing a computerprogram executable on a computer configured for performing video coding,comprising: performing inter-prediction and/or intra-prediction forreducing temporal and/or spatial redundancies; performing a transformand quantization during encoding and/or inverse transform and inversequantization during decoding; performing context-based adaptive binaryarithmetic coding (CABAC) during encoding and/or decoding; andperforming binarization of a non-zero Delta-QP (dQP) by (a) mappingabsolute value of dQP using unary coding; (b) separately coding sign ofdQP; and (c) combining binary strings for sign and absolute value.

18. The computer-readable media of embodiment 17, wherein saidprogramming is alternatively configured for execution on said computerfor coding of the sign for dQP prior to mapping of the absolute value ofdQP.

19. The computer-readable media of embodiment 17: wherein said videocoding utilizes a Coding Unit (CU) structure in which block sizes arenot fixed, and in which the Largest Coding Unit (LCU) is separated intoCUs each having its own QP which can differ from one CU to another; andwherein Delta-QP (dQP) signals the difference between QP of the currentCU and predicted QP is encoded in the syntax.

20. The computer-readable media as recited in embodiment 17, whereinsaid video coding is performed in a high efficiency coding modeaccording to the High Efficiency Video Coding (HEVC) standard.

Embodiments of the present invention may be described with reference toflowchart illustrations of methods and systems according to embodimentsof the invention, and/or algorithms, formulae, or other computationaldepictions, which may also be implemented as computer program products.In this regard, each block or step of a flowchart, and combinations ofblocks (and/or steps) in a flowchart, algorithm, formula, orcomputational depiction can be implemented by various means, such ashardware, firmware, and/or software including one or more computerprogram instructions embodied in computer-readable program code logic.As will be appreciated, any such computer program instructions may beloaded onto a computer, including without limitation a general purposecomputer or special purpose computer, or other programmable processingapparatus to produce a machine, such that the computer programinstructions which execute on the computer or other programmableprocessing apparatus create means for implementing the functionsspecified in the block(s) of the flowchart(s).

Accordingly, blocks of the flowcharts, algorithms, formulae, orcomputational depictions support combinations of means for performingthe specified functions, combinations of steps for performing thespecified functions, and computer program instructions, such as embodiedin computer-readable program code logic means, for performing thespecified functions. It will also be understood that each block of theflowchart illustrations, algorithms, formulae, or computationaldepictions and combinations thereof described herein, can be implementedby special purpose hardware-based computer systems which perform thespecified functions or steps, or combinations of special purposehardware and computer-readable program code logic means.

Furthermore, these computer program instructions, such as embodied incomputer-readable program code logic, may also be stored in acomputer-readable memory that can direct a computer or otherprogrammable processing apparatus to function in a particular manner,such that the instructions stored in the computer-readable memoryproduce an article of manufacture including instruction means whichimplement the function specified in the block(s) of the flowchart(s).The computer program instructions may also be loaded onto a computer orother programmable processing apparatus to cause a series of operationalsteps to be performed on the computer or other programmable processingapparatus to produce a computer-implemented process such that theinstructions which execute on the computer or other programmableprocessing apparatus provide steps for implementing the functionsspecified in the block(s) of the flowchart(s), algorithm(s), formula(e),or computational depiction(s).

From the discussion above it will be appreciated that the invention canbe embodied in various ways, including the following:

Although the description above contains many details, these should notbe construed as limiting the scope of the invention but as merelyproviding illustrations of some of the presently preferred embodimentsof this invention. Therefore, it will be appreciated that the scope ofthe present invention fully encompasses other embodiments which maybecome obvious to those skilled in the art, and that the scope of thepresent invention is accordingly to be limited by nothing other than theappended claims, in which reference to an element in the singular is notintended to mean “one and only one” unless explicitly so stated, butrather “one or more.” All structural and functional equivalents to theelements of the above-described preferred embodiment that are known tothose of ordinary skill in the art are expressly incorporated herein byreference and are intended to be encompassed by the present claims.Moreover, it is not necessary for a device or method to address each andevery problem sought to be solved by the present invention, for it to beencompassed by the present claims. Furthermore, no element, component,or method step in the present disclosure is intended to be dedicated tothe public regardless of whether the element, component, or method stepis explicitly recited in the claims. No claim element herein is to beconstrued as a “means plus function” element unless the element isexpressly recited using the phrase “means for”. No claim element hereinis to be construed as a “step plus function” element unless the elementis expressly recited using the phrase “step for”.

What is claimed is:
 1. A decoding apparatus, comprising: a decoding unitconfigured to: obtain each of an absolute value of a differencequantization parameter and an identification value of the differencequantization parameter from a bitstream; and decode the absolute valueof the difference quantization parameter and the identification value ofthe difference quantization parameter, wherein the identification valueis decoded subsequent to the decode of the absolute value; thedifference quantization parameter is a difference between a quantizationparameter of a current coding unit and a predicted quantizationparameter of the current coding unit, the bitstream is generated byseparation of the difference quantization parameter into the absolutevalue of the difference quantization parameter and the identificationvalue of the difference quantization parameter, and by an encodingoperation of both the absolute value and the identification value, theidentification value indicates a sign of the difference quantizationparameter indicating that the difference quantization parameter is oneof positive or negative, the absolute value of the differencequantization parameter is mapped to a binary string using unary codes,and the identification value is encoded subsequent to encode of thebinary string of the absolute value in the encoding operation; and aninverse quantization unit configured to: set the difference quantizationparameter based on the decoded absolute value and the decodedidentification value; obtain quantized data based on a decodingoperation of the bitstream; and inverse quantize the quantized databased on the quantization parameter of the current coding unit, whereinthe quantization parameter of the current coding unit is a sum of theset difference quantization parameter and the predicted quantizationparameter.
 2. The decoding apparatus according to claim 1, wherein thedecoding unit is further configured to decode the absolute value and theidentification value based on the difference quantization parameter thatis non-zero.
 3. The decoding apparatus according to claim 1, furthercomprising a determination unit configured to determine the differencequantization parameter that is non-zero based on a flag, wherein a valueof the flag indicates that the difference quantization parameter isnon-zero, and the decoding unit is further configured to decode theabsolute value and the identification value based on the differencequantization parameter that is non-zero.
 4. The decoding apparatusaccording to claim 1, wherein the decoding unit is further configured todecode the absolute value and the identification value based on a binaryarithmetic decoding process.
 5. The decoding apparatus according toclaim 1, wherein the bitstream is generated as a syntax, and theidentification value is subsequent to the absolute value in thebitstream.
 6. A decoding method, comprising: obtaining each of anabsolute value of a difference quantization parameter and anidentification value of the difference quantization parameter from abitstream; decoding the absolute value of the difference quantizationparameter and the identification value of the difference quantizationparameter, wherein the identification value is decoded subsequent to thedecode of the absolute value; the difference quantization parameter is adifference between a quantization parameter of a current coding unit anda predicted quantization parameter of the current coding unit, thebitstream is generated by separation of the difference quantizationparameter into the absolute value of the difference quantizationparameter and the identification value of the difference quantizationparameter, and by encoding of both the absolute value and theidentification value, the identification value indicates a sign of thedifference quantization parameter indicating that the differencequantization parameter is one of positive or negative, the absolutevalue of the difference quantization parameter is mapped to a binarystring using unary codes, and the identification value is encodedsubsequent to encode of the binary string of the absolute value in theencoding; setting the difference quantization parameter based on thedecoded absolute value and the decoded identification value; obtainingquantized data based on decoding of the bitstream; and inversequantizing the quantized data based on the quantization parameter of thecurrent coding unit, wherein the quantization parameter of the currentcoding unit is a sum of the set difference quantization parameter andthe predicted quantization parameter.
 7. The decoding method accordingto claim 6, wherein the absolute value and the identification value aredecoded based on the difference quantization parameter that is non-zero.8. The decoding method according to claim 6, further comprising:determining the difference quantization parameter that is non-zero basedon a flag, wherein a value of the flag indicates that the differencequantization parameter is non-zero; and decoding each of the absolutevalue and the identification value based on the difference quantizationparameter that is non-zero.
 9. The decoding method according to claim 6,wherein the absolute value and the identification value are decodedbased on a binary arithmetic decoding process.
 10. The decoding methodaccording to claim 6, wherein the bitstream is generated as a syntax,and the identification value is subsequent to the absolute value in thebitstream.
 11. The decoding apparatus according to claim 1, wherein eachof the absolute value and the identification value of the differencequantization parameter is separately mapped to a unary code, and theidentification value of the difference quantization parameter and theabsolute value of the difference quantization parameter are separatelyencoded in the encoding operation.